Impossibility and Feasibility Results for Zero Knowledge with Public Keys
نویسندگان
چکیده
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]. Specifically we show the impossibility of 3-round concurrent (and thus resettable) black-box zeroknowledge argument systems with sequential soundness for non-trivial languages. In light of the previous state-of-the-art, our result completes the analysis of the round complexity of black-box zero knowledge in the BPK model with respect to the notions of soundness and black-box zero
منابع مشابه
Lower Bounds for Non-interactive Zero-Knowledge
We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string model, we exhibit a lower bound for the trade-off between hardness assumptions and the length of the random string for non-interactive zero-knowledge proofs. This generalizes a previous result ruling out non-interactive zero-knowl...
متن کاملLimits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
For over 20 years, black-box impossibility results have been used to argue the infeasibility of constructing certain cryptographic primitives (e.g., key agreement) from others (e.g., one-way functions). A widely recognized limitation of such impossibility results, however, is that they say nothing about the usefulness of (known) nonblack-box techniques. This is unsatisfying, as we would at leas...
متن کاملLower Bounds for Non-Black-Box Zero Knowledge
We show new lower bounds and impossibility results for general (possibly non-black-box ) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity assumptions: 1. There does not exist a two-round zero-knowledge proof system with perfect completeness for an NP-complete language. The previous impossibility result for two-round zero knowledge, by Goldreich and Ore...
متن کاملA Study of Separations in Cryptography: New Results and New Models
Title of dissertation: A STUDY OF SEPARATIONS IN CRYPTOGRAPHY: NEW RESULTS AND NEW MODELS Arkady Yerukhimovich, Doctor of Philosophy, 2011 Dissertation directed by: Professor Jonathan Katz Department of Computer Science For more than 20 years, black-box impossibility results have been used to argue the infeasibility of constructing certain cryptographic primitives (e.g., key agreement) from oth...
متن کاملZero-knowledge with Public Keys Zero-knowledge with Public Keys Acknowledgments
In STOC 2000, Canetti, Goldreich, Goldwasser, and Micali put forward the strongest notion of zero-knowledge to date, resettable zero-knowledge (RZK) and implemented it in constant rounds in a new model, where the verifier simply has a public key registered before any interaction with the prover. This work explores their new public-key model for zero-knowledge protocols. First, it shows that the...
متن کامل